翻訳と辞書 Words near each other ・ Prenesta fulvirufalis ・ Prenesta ignefactalis ・ Prenesta iphiclalis ・ Prenesta latifascialis ・ Prenesta luciferalis ・ Prenesta nysalis ・ Prenesta ornamentalis ・ Prenesta philinoralis ・ Prenesta prosopealis ・ Prenesta protenoralis ・ Prenesta quadrifenestralis ・ Prenesta rubralis ・ Prenesta scyllalis ・ Prenesta sunialis ・ Preneuse-class frigate ・ Prenex normal form ・ Prenez Garde ・ Preng Doçi ・ Prenj ・ Prenk ・ Prenk Pervizi ・ Prenkë Jakova ・ Prenocephale ・ Prenoceratops ・ Prenois ・ Prenol ・ Prenolepis ・ Prenolepis imparis ・ Prenolepis naoroji ・ Prenomen (Ancient Egypt) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Prenex normal form ： ウィキペディア英語版 Prenex normal form A formula of the predicate calculus is in prenex〔The term 'prenex' comes from the Latin ''praenexus'' "tied or bound up in front", past participle of ''praenectere'' ().〕 normal form if it is written as a string of quantifiers (referred to as the prefix) followed by a quantifier-free part (referred to as the matrix). Every formula in classical logic is equivalent to a formula in prenex normal form. For example, if $\backslash phi(y)$, $\backslash psi(z)$, and $\backslash rho(x)$ are quantifier-free formulas with the free variables shown then :$\backslash forall\; x\; \backslash exists\; y\; \backslash forall\; z\; (\backslash phi(y)\; \backslash lor\; (\backslash psi(z)\; \backslash rightarrow\; \backslash rho(x)))$ is in prenex normal form with matrix $\backslash phi(y)\; \backslash lor\; (\backslash psi(z)\; \backslash rightarrow\; \backslash rho(x))$, while :$\backslash forall\; x\; ((\backslash exists\; y\; \backslash phi(y))\; \backslash lor\; ((\backslash exists\; z\; \backslash psi(z)\; )\; \backslash rightarrow\; \backslash rho(x)))$ is logically equivalent but not in prenex normal form. == Conversion to prenex form == Every first-order formula is logically equivalent (in classical logic) to some formula in prenex normal form. There are several conversion rules that can be recursively applied to convert a formula to prenex normal form. The rules depend on which logical connectives appear in the formula. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Prenex normal form」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.